Chordal Topologies for Interconnection Networks

نویسندگان

  • Ramón Beivide
  • Carmen Martínez
  • Cruz Izu
  • Jaime Gutierrez
  • José-Ángel Gregorio
  • José Miguel-Alonso
چکیده

The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. Two geometric characterizations are given, one in the plane and other in the space. Both characterizations facilitate the analysis of their topological properties and corroborate their suitability for implementing interconnection networks for distributed and parallel computers. Also, a distance-hereditary non-disjoint decomposition of these graphs into rings is computed. Besides its practical consequences, this decomposition allows us the presentation of these optimal circulant graphs as a particular evolution of the traditional ring topology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interconnection Topologies for Parallel Processing Systems

The growing demand for more computing power at increasing speed in many scienti c and engineering applications made it necessary to develop advanced computer archi tectures based on the concept of parallel processing In general a parallel computer system consists of various processing and memory units and other shared resources A critical issue in design and analysis of parallel systems is the ...

متن کامل

Self-spanner graphs

We introduce the (k, `)–self-spanners graphs to model non-reliable interconnection networks. Such networks can be informally characterized as follows: if at most ` edges have failed, as long as two vertices remain connected, the distance between these vertices in the faulty graph is at most k times the distance in the non-faulty graph. By fixing the values k and ` (called stretch factor and fau...

متن کامل

The Embedding of Meshes and Trees into Degree Four Chordal Ring Networks

In this paper a particular computer interconnection network, the symmetric chordal ring network of degree four, is presented, and the mapping of meshes and binary trees onto chordal ring networks is analysed. Expressions for the network diameter (the maximum distance a message must travel between any pair of computers) and the mean inter-computer distance are derived for a sub-set of chordal ri...

متن کامل

Multi-Dimensional Interval Routing Schemes

Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas k...

متن کامل

Periodically Regular Chordal Rings

ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003